Automorphisms of subword-posets
نویسندگان
چکیده
In this paper the automorphism group of two posets, Dk,n and Bm,n is determined. Dk,n is the poset of DNA strands of length at most n, built up with k complement pairs of letters, and partially ordered by the subsequence relation. Bm,n is the set of all subsequences of the word um,n = a1...an defined over the alphabet {0, 1, ..., (m−1)}, where ai ≡ i (mod m). The automorphism group of Bm,n was known already (see Burosch et al. [1]), here a short proof is presented as an illustration of the method used in the first part.
منابع مشابه
Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders
We consider the poset SO(n) of all words over an n{element alphabet ordered by the subword relation. It is known that SO(2) falls into the class of Macaulay posets, i.e. there is a theorem of Kruskal{Katona type for SO(2). As the corresponding linear ordering of the elements of SO(2) the vip{order can be chosen. Daykin introduced the V {order which generalizes the vip{order to the n 2 case. He ...
متن کاملQuotients of Peck Posets
An elementary, self-contained proof of a result of Pouzet and Rosenberg and of Harper is given. This result states that the quotient of certain posets (called unitary Peck) by a finite group of automorphisms retains some nice properties, including the Sperner property. Examples of unitary Peck posets are given, and the techniques developed here are used to prove a result of Lovhz on the edge-re...
متن کاملA generalization of Chebyshev polynomials and non rooted posets
Bjorner was the first to determine the Mobius functions of factor orders and subword orders. To determine the Mobius functions, he used involutions, shellability, and generating functions. [2][3][4] Bjorner and Stanley found an interesting relation among the subword order derived from a two point set {a, b} , symmetric groups and composition orders. [6] Factor orders, subword orders, and genera...
متن کاملThe m-Colored Composition Poset
We generalize Björner and Stanley’s poset of compositions to m-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young’s lattice of partitions, including links to (quasi-)symmetric functions and representation theory. Here we show that many of these analogies hold for any number of colors. While many of the proofs for Björner and Stanley’s pos...
متن کاملOn the Möbius Function and Topology of General Pattern Posets
We introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the Möbius function and topology of such pattern posets. We prove our results using a poset fibration based on the embeddings of the poset, where embeddings are representations of occurrences. We show that the Möbius ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 305 شماره
صفحات -
تاریخ انتشار 2005